Efficient Discovery of Large Synchronous Events in Neural Spike Streams

Conditional Probability%2DBased Significance Tests for Sequential Patterns in Multineuronal Spike Trains.

Temporal data mining for root%2Dcause analysis of machine faults in automotive assembly lines

Inferring Neuronal Network Connectivity from Spike Data A Temporal Datamining Approach

Conditional probability based significance tests for sequential patterns in multi%2Dneuronal spike trains

Inferring neuronal network connectivity from spike data A temporal data mining approach.

A fast algorithm for finding frequent episodes in event streams.
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the frequency of an episode is some suitable measure of how often the episode occurs in the data sequence. Recently, we proposed a new frequency measure for episodes based on the notion of non-overlapped occurrences of episodes in the event sequence, and showed that, such a definition, in addition to yielding computationally efficient algorithms, has some important theoretical properties in connecting frequent episode discovery with HMM learning. This paper presents some new algorithms for frequent episode discovery under this non-overlapped occurrences-based frequency definition. The algorithms presented here are better (by a factor of N, where N denotes the size of episodes being discovered) in terms of both time and space complexities when compared to existing methods for frequent episode discovery. We show through some simulation experiments, that our algorithms are very efficient. The new algorithms presented here have arguably the least possible orders of space and time complexities for the task of frequent episode discovery.
Inferring Neuronal Network Connectivity using Time%2Dconstrained Episodes

Discovering Patterns in Multi%2Dneuronal Spike Trains using the Frequent Episode Method

Discovering Frequent Generalized Episodes When Events Persist for Different Durations.

Network reconstruction from dynamic data.



The third SIGKDD workshop on mining temporal and sequential data %28KDD%2FTDM 2004%29.

Two Timescale Analysis of the Alopex Algorithm for Optimization.

Alopex A Correlation%2DBased Learning Algorithm for Feedforward and Recurrent Neural Networks.
We present a learning algorithm for neural networks, called Alopex. Instead of error gradient, Alopex uses local correlations between changes in individual weights and changes in the global error measure. The algorithm does not make any assump-tions about transfer functions of individual neurons, and does not explicitly depend on the functional form of the error measure. Hence, it can be used in networks with arbi-trary transfer functions and for minimizing a large class of error measures. The learn-ing algorithm is the same for feed-forward and recurrent networks. All the weights in a network are updated simultaneously, using only local computations. This allows com-plete parallelization of the algorithm. The algorithm is stochastic and it uses a ‘tem-perature ’ parameter in a manner similar to that in simulated annealing. A heuristic ‘ annealing schedule ’ is presented which is effective in finding global minima of error surfaces. In this paper, we report extensive simulation studies illustrating these advan-tages and show that learning times are comparable to those for standard gradient des-cent methods. Feed-forward networks trained with Alopex are used to solve the MONK’s problems and symmetry problems. Recurrent networks trained with the same algorithm are used for solving temporal XOR problems. Scaling properties of the algorithm are demonstrated using encoder problems of different sizes and advantages of appropriate error measures are illustrated using a variety of problems.
Speaker%2DIndependent Digit Recognition Using a Neural Network with Time%2DDelayed Connections.

